Concise tensors of minimal border rank

نویسندگان

چکیده

We determine defining equations for the set of concise tensors minimal border rank in $${\mathbb {C}}^m{\mathord { \otimes } }{\mathbb {C}}^m$$ when $$m=5$$ and $$1_*$$ -generic $$m=5,6$$ . solve classical problem algebraic complexity theory classifying special case Our proofs utilize two recent developments: 111-equations defined by Buczyńska–Buczyński results Jelisiejew–Šivic on variety commuting matrices. introduce a new invariant tensor, its 111-algebra, exploit it to give strengthening Friedland’s normal form 1-degenerate satisfying Strassen’s equations. use 111-algebra characterize wild classify them {C}}^5{\mathord {C}}^5$$

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Explicit tensors of border rank at least 2n-1

For odd m, I write down tensors in C m ⊗C m ⊗C m of border rank at least 2m − 1, showing the non-triviality of the Young-flattening equations of [6] that vanish on the matrix multiplication tensor. I also study the border rank of the tensors of [1] and [3]. I show the tensors T 2 k ∈ C k ⊗C 2 k ⊗C 2 k , of [1], despite having rank equal to 2 k+1 − 1, have border rank equal to 2 k. I show the eq...

متن کامل

On the geometry of border rank algorithms for matrix multiplication and other tensors with symmetry

We establish basic information about border rank algorithms for the matrix multiplication tensor and other tensors with symmetry. We prove that border rank algorithms for tensors with symmetry (such as matrix multiplication and the determinant polynomial) come in families that include representatives with normal forms. These normal forms will be useful both to develop new efficient algorithms a...

متن کامل

Orthogonal Rank Decompositions for Tensors

The theory of orthogonal rank decompositions for matrices is well understood, but the same is not true for tensors. For tensors, even the notions of orthogonality and rank can be interpreted several diierent ways. Tensor decompositions are useful in applications such as principal component analysis for multiway data. We present two types of orthogonal rank decompositions and describe methods to...

متن کامل

Irreducible Killing Tensors from Third Rank Killing-Yano Tensors

We investigate higher rank Killing-Yano tensors showing that third rank Killing-Yano tensors are not always trivial objects being possible to construct irreducible Killing tensors from them. We give as an example the Kimura IIC metric were from two rank Killing-Yano tensors we obtain a reducible Killing tensor and from third rank Killing-Yano tensors we obtain three Killing tensors, one reducib...

متن کامل

On the generic rank of 3-tensors

We study the generic rank of 3-tensors using results from matrices and algebraic geometry. We state a conjecture about the exact values of the generic rank of 3-tensors over the complex numbers. We also discuss generic ranks over the real numbers. 2000 Mathematics Subject Classification. 14A25, 14P10, 15A69.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematische Annalen

سال: 2023

ISSN: ['1432-1807', '0025-5831']

DOI: https://doi.org/10.1007/s00208-023-02569-y